Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
871	Constructive Root Bound for k-Ary Rational Input Numbers Sylvain Pion 1 INRIA Sophia-Antipolis, BP 93, 06902 Sophia-Antipolis cedex, France. Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2006-11-08 10:44:22 Transcendental numbers Diophantine approximation Finite fields Models of computation Mathematics Constructible universe Number theory
872	Part IV Recursion By now you’re very familiar with the idea of implementing a function by composing other functions. In effect we are breaking down a large problem into smaller parts. The idea of recursion—as usual, Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2008-08-15 14:41:15 Computing Recursion Computability theory Theory of computation Mathematical logic There Was an Old Lady Who Swallowed a Fly FO Infinite loop Reduction Computer programming Theoretical computer science Programming idioms
873	Integrating Hands-on Work into the Formal Languages Course via Tools and Programming Susan H. Rodger Department of Computer Science Duke University Durham, NC[removed] Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 1998-09-22 13:06:06 Theoretical computer science Pushdown automaton Deterministic pushdown automaton Nondeterministic finite automaton Finite-state machine Non-deterministic Turing machine Turing machine LL parser LR parser Theory of computation Automata theory Models of computation
874	FerienAkademie[removed]Course ”Quantum computation” Quantum algorithm for Hilbert’s 10th problem Add to Reading List Source URL: yury.name Language: English - Date: 2006-01-02 14:44:12 Mathematical logic Theory of computation Computability theory Computational complexity theory Halting problem Diophantine equation Entscheidungsproblem Quantum computer Algorithm Theoretical computer science Mathematics Applied mathematics
875	Black-Box Garbled RAM Sanjam Garg∗ Steve Lu† Rafail Ostrovsky‡ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-02 23:37:52 Computer memory Circuit complexity Circuit Theory of computation NC Computer Electronic circuit Central processing unit Memory Theoretical computer science Electronics Applied mathematics
876	A Visual and Interactive Automata Theory Course with JFLAP 4.0 ∗ Ryan Cavalcante Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2003-12-22 12:57:12 Compiler construction Theoretical computer science Computer science Automata theory LL parser LR parser Parsing Nondeterministic finite automaton Finite-state machine Formal languages Models of computation Theory of computation
877	Looking for Busy Beavers. A socio-philosophical study of a computer-assisted proof. Liesbeth De Mol∗ [removed] Add to Reading List Source URL: logica.ugent.be Language: English - Date: 2011-11-29 04:50:50 Computer science Theory of computation Busy beaver Turing machine Halting problem Computable function Alan Turing Mathematical proof Computability Mathematics Theoretical computer science Computability theory
878	The Complexity of Accurate Floating Point Computation or Can we Compute Eigenvalues In Polynomial Time? James Demmel Mathematics and Computer Science Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2002-08-13 17:34:17 Numerical linear algebra Matrix theory Eigenvalues and eigenvectors Matrix Pivot element Floating point Singular value decomposition Algorithm Algebra Linear algebra Mathematics
879	From System F to Typed Assembly Language GREG MORRISETT and DAVID WALKER Cornell University KARL CRARY Carnegie Mellon University and Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 1999-10-21 10:40:17 Computing Models of computation Functional languages Program analysis Type system Standard ML Type safety Typed assembly language Lambda calculus Software engineering Type theory Programming language theory
880	Automata theory Regular Cost Functions Contributions of the thesis Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2013-03-18 10:44:50 Computability theory Automata theory Theory of computation Models of computation Church–Turing thesis Finite-state machine Algorithm Decidability Krohn–Rhodes theory Theoretical computer science Computer science Mathematics

UPDATE